A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence
نویسندگان
چکیده
منابع مشابه
Deciding Graph non-Hamiltonicity via a Closure Algorithm
We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the n! Hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices P, such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n + 1. A graph instance (G) is initially coded as exclusion set ...
متن کاملA closure concept based on neighborhood unions of independent triples
The well-known closure concept of Bondy and Chvatal is based on degree-sums of pairs of nonadjacent (independent) vertices. We show that a more general concept due to Ainouche and Christofides can be restated in terms of degree-sums of independent triples. We introduce a closure concept which is based on neighborhood unions of independent triples and which also generalizes the closure concept o...
متن کاملtask-based language teaching in iran: a mixed study through constructing and validating a new questionnaire based on theoretical, sociocultural, and educational frameworks
جنبه های گوناگونی از زندگی در ایران را از جمله سبک زندگی، علم و امکانات فنی و تکنولوژیکی می توان کم یا بیش وارداتی در نظر گرفت. زبان انگلیسی و روش تدریس آن نیز از این قاعده مثتسنی نیست. با این حال گاهی سوال پیش می آید که آیا یک روش خاص با زیر ساخت های نظری، فرهنگی اجتماعی و آموزشی جامعه ایرانی سازگاری دارد یا خیر. این تحقیق بر اساس روش های ترکیبی انجام شده است.پرسش نامه ای نیز برای زبان آموزان ...
deciding graph non-hamiltonicity via a closure algorithm
we present a matching and lp based heuristic algorithm that decides graph non-hamiltonicity. each of the n! hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices p, such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n + 1. a graph instance (g) is initially coded as exclusion set ...
متن کاملDeciding Graph non-Hamiltonicity via a Closure Algorithm
We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the n! Hamilton cycles in a complete directed graph on n+ 1 vertices corresponds with each of the n! n-permutation matrices P , such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n+ 1. A graph instance (G) is initially coded as exclusion set E...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2011
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.11.008